Projective parameterized linear codes
نویسندگان
چکیده
In this paper we estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We find the length of these codes and we give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we find an upper bound for the minimum distance and, in some cases, we give some lower bounds for the regularity index and the minimum distance. These lower bounds work in several cases, particularly for any projective parameterized code associated to the incidence matrix of uniform clutters and then they work in the case of graphs.
منابع مشابه
Projective Parameterized Linear Codes Arising from some Matrices and their Main Parameters
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to two ideals, one of them being the vanishing ideal of the projective torus. Also we will find an upper bound for the minimum distance and, i...
متن کاملDirect products in projective Segre codes
Let K = Fq be a finite field. We introduce a family of projective Reed-Muller-type codes called projective Segre codes. Using commutative algebra and linear algebra methods, we study their basic parameters and show that they are direct products of projective Reed-Mullertype codes. As a consequence we recover some results on projective Reed-Muller-type codes over the Segre variety and over proje...
متن کاملOn the Main Parameters of Parameterized Codes
In this paper we will estimate the main parameters of some evaluation codes which are known as parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert function associated to the vanishing ideal of the projective torus. Also we will find an upper bound for the minimum distance and, in some cases, we will give some lower bou...
متن کاملCoprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k − 1, q) and projective (n, k, n − r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable length admit only projective extensions. Thus, we are able to prove the maximality of many known linear codes. At the same time our results sharply limit the possibilities for constructing long nonlinear codes. We also s...
متن کاملThe second generalized Hamming weight of some evaluation codes arising from a projective torus
In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete bipartite graph. Also, at the beginning, we obtain some results about the generalized Hamming weights of some evaluation codes arising from a complete intersect...
متن کامل